Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms
نویسندگان
چکیده
We show that, given an ordinary lambda-term and a normal resource lambda-term which appears in the normal form of its Taylor expansion, the unique resource term of the Taylor expansion of the ordinary lambda-term reducing to this normal resource term can be obtained by running a version of the Krivine abstract machine.
منابع مشابه
Krivine Machine and Taylor Expansion in a Non-uniform Setting
The Krivine machine is an abstract machine implementing the linear head reduction of λ -calculus. Ehrhard and Regnier gave a resource sensitive version returning the annotated form of a λ -term accounting for the resources used by the linear head reduction. These annotations take the form of terms in the resource λ -calculus. We generalize this resource-driven Krivine machine to the case of the...
متن کاملBöhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms
We introduce and study a version of Krivine’s machine which provides a precise information about how much of its argument is needed for performing a computation. This information is expressed as a term of a resource lambda-calculus introduced by the authors in a recent article; this calculus can be seen as a fragment of the differential lambda-calculus. We use this machine to show that Taylor e...
متن کاملNormalizing the Taylor expansion of non-deterministic {\lambda}-terms, via parallel reduction of resource vectors
It has been known since Ehrhard and Regnier’s seminal work on the Taylor expansion of λ-terms that this operation commutes with normalization: the expansion of a λ-term is always normalizable and its normal form is the expansion of the Böhm tree of the term. We generalize this result to the non-uniform setting of the algebraic λ-calculus, i.e., λ-calculus extended with linear combinations of te...
متن کاملA characterization of the Taylor expansion of λ-terms∗
The Taylor expansion of λ-terms, as introduced by Ehrhard and Regnier, expresses a λ-term as a series of multi-linear terms, called simple terms, which capture bounded computations. Normal forms of Taylor expansions give a notion of infinitary normal forms, refining the notion of Böhm trees in a quantitative setting. We give the algebraic conditions over a set of normal simple terms which chara...
متن کاملNon-deterministic Böhm trees
Lambda calculus is well established as the formal model of functional programming. Non-determinism is an interesting conceptual issue, often considered in process-calculi. It is interesting to mix lambda-calculus and non-determinism, firstly because programmers use functional programming but also concurrent methods, networks and multi-users systems, secondly as a step towards more complex langu...
متن کامل